Time Stamps for Fixed-Point Approximation

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

A Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems

New three-step iteration process and fixed point approximation in Banach spaces

‎In this paper we propose a new iteration process‎, ‎called the $K^{ast }$ iteration process‎, ‎for approximation of fixed‎ ‎points‎. ‎We show that our iteration process is faster than the existing well-known iteration processes using numerical examples‎. ‎Stability of the $K^{ast‎}‎$ iteration process is also discussed‎. ‎Finally we prove some weak and strong convergence theorems for Suzuki ge...

Approximation the fuzzy solution of the non linear fuzzy Volterra integro differential equation using fixed point theorems

A new approximation method for common fixed points of a finite family of nonexpansive non-self mappings in Banach spaces

In this paper, we introduce a new iterative scheme to approximate a common fixed point for a finite family of nonexpansive non-self mappings. Strong convergence theorems of the proposed iteration in Banach spaces.